|
In mathematics, a bijection, bijective function or one-to-one correspondence is a function between the elements of two sets, where every element of one set is paired with exactly one element of the other set, and every element of the other set is paired with exactly one element of the first set. There are no unpaired elements. In mathematical terms, a bijective function ''f'': ''X'' → ''Y'' is a one-to-one (injective) and onto (surjective) mapping of a set ''X'' to a set ''Y''. A bijection from the set ''X'' to the set ''Y'' has an inverse function from ''Y'' to ''X''. If ''X'' and ''Y'' are finite sets, then the existence of a bijection means they have the same number of elements. For infinite sets the picture is more complicated, leading to the concept of cardinal number, a way to distinguish the various sizes of infinite sets. A bijective function from a set to itself is also called a ''permutation''. Bijective functions are essential to many areas of mathematics including the definitions of isomorphism, homeomorphism, diffeomorphism, permutation group, and projective map. ==Definition== For a pairing between ''X'' and ''Y'' (where ''Y'' need not be different from ''X'') to be a bijection, four properties must hold: # each element of ''X'' must be paired with at least one element of ''Y'', # no element of ''X'' may be paired with more than one element of ''Y'', # each element of ''Y'' must be paired with at least one element of ''X'', and # no element of ''Y'' may be paired with more than one element of ''X''. Satisfying properties (1) and (2) means that a bijection is a function with domain ''X''. It is more common to see properties (1) and (2) written as a single statement: Every element of ''X'' is paired with exactly one element of ''Y''. Functions which satisfy property (3) are said to be "onto ''Y'' " and are called surjections (or surjective functions). Functions which satisfy property (4) are said to be "one-to-one functions" and are called injections (or injective functions).〔There are names associated to properties (1) and (2) as well. A relation which satisfies property (1) is called a ''total relation'' and a relation satisfying (2) is a ''single valued relation''.〕 With this terminology, a bijection is a function which is both a surjection and an injection, or using other words, a bijection is a function which is both "one-to-one" and "onto". 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Bijection」の詳細全文を読む スポンサード リンク
|